#include"sort.h"



int main()
{


	/*int a[] = { 2,6,5,8,4,3,5,0,1 };*/
	//int a[] = { 9,1,2,5,7,4,6,3,44,7,54,3,3 };
	int a[] = { 9,1,7,4,3,7,3,3,1,22,55,77,46,97,42,90,24,645,345 };


	//InsertSort(a, sizeof(a) / sizeof(a[0]));

	//HeapSort(a, sizeof(a) / sizeof(a[0]));

	//BubbleSort(a, sizeof(a) / sizeof(a[0]));

	ShellSort(a, sizeof(a) / sizeof(a[0]));

	//SelectSore(a, sizeof(a) / sizeof(a[0]));

	//QuickSort1(a, 0, sizeof(a) / sizeof(a[0]) - 1);

	//QuickSort2(a, 0, sizeof(a) / sizeof(a[0]) - 1);

	QuickSort3(a, 0, sizeof(a) / sizeof(a[0]) - 1);

	//QuickSort4(a, 0, sizeof(a) / sizeof(a[0]) - 1);

	//QuickSoreNonR(a, 0, sizeof(a) / sizeof(a[0]) - 1);

	//MergeSort(a, sizeof(a) / sizeof(a[0]));

	//MergeSortNonR(a, sizeof(a) / sizeof(a[0]));

	//CountSort(a, sizeof(a) / sizeof(a[0]));

	Print(a, sizeof(a) / sizeof(a[0]));

	return 0;
}